#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int h[N], f[N];

int main() {
  int ans = 0;
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> h[i];
  }
  for (int i = 1; i <= n; i++) {
    f[i] = 1;
    for (int j = 1; j <= i; j++) {
      if (h[i] > h[j]) //最长上升
        f[i] = max(f[i], f[j] + 1);
      ans = max(f[i], ans);
    }
  }
  cout << ans;
}
